Irregularity Measures of Subdivision Vertex-Edge Join of Graphs

نویسندگان

چکیده

The study of graphs and networks accomplished by topological measures plays an applicable task to obtain their hidden topologies. This procedure has been greatly used in cheminformatics, bioinformatics, biomedicine, where estimations based on graph invariants have made available for effectively communicating with the different challenging tasks. Irregularity are mostly characterization nonregular graphs. In several applications problems various areas research like material engineering chemistry, it is helpful be well-informed about irregularity underline structure. Furthermore, indices not only suitable quantitative structure-activity relationship (QSAR) structure-property (QSPR) studies but also a number chemical physical properties, including toxicity, enthalpy vaporization, resistance, boiling melting points, entropy. this article, we compute variance vertex degrees, total index, σ Gini index new operation.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Edge-coloring Vertex-weightings of Graphs

Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...

متن کامل

Total vertex irregularity strength of corona product of some graphs

A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...

متن کامل

A note on vertex-edge Wiener indices of graphs

The vertex-edge Wiener index of a simple connected graph G is defined as the sum of distances between vertices and edges of G. Two possible distances D_1(u,e|G) and D_2(u,e|G) between a vertex u and an edge e of G were considered in the literature and according to them, the corresponding vertex-edge Wiener indices W_{ve_1}(G) and W_{ve_2}(G) were introduced. In this paper, we present exact form...

متن کامل

total vertex irregularity strength of corona product of some graphs

a vertex irregular total k-labeling of a graph g with vertex set v and edge set e is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. the total vertex irregularity strength of g, denoted by tvs(g)is the minimum value of the largest label k over all such irregular assignment. in this paper, we study the to...

متن کامل

On total vertex irregularity strength of graphs

Martin Bača et al. [2] introduced the problem of determining the total vertex irregularity strengths of graphs. In this paper we discuss how the addition of new edge affect the total vertex irregularity strength.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Chemistry

سال: 2021

ISSN: ['2090-9063', '2090-9071']

DOI: https://doi.org/10.1155/2021/6673221